/*
 * Copyright (c) 2010 CCX(China) Co.,Ltd. All Rights Reserved.
 *
 * This software is the confidential and proprietary information of
 * CCX(China) Co.,Ltd. ("Confidential Information").
 * It may not be copied or reproduced in any manner without the express 
 * written permission of CCX(China) Co.,Ltd.
 *
 * Author: zhaosj
 * Date: 2010-6-3 下午12:24:15
 */
package com.array;

/**
 * @author Administrator
 * 
 */
public class SortCol {

	public static void sortlie()// 标准的冒泡
	{
		double[][] a = { { 0.1, 100 }, { 2.5, 90 },{1.5 , 250} };
		int lie = a[0].length ;
		int hang = a.length ;

		for (int j = 0; j < 1; j++) {
			for (int outer = hang - 1; outer > 0; outer--) {
				for (int inner = 0; inner < outer; inner++) {
					if (a[inner][j] > a[inner + 1][j]) {
						double temp = a[inner][j];
						a[inner][j] = a[inner + 1][j];
						a[inner + 1][j] = temp;
					}
				}
			}
		}
		
		System.out.println("------------");
	}
	
	public static void main(String[] args) {
		
		sortlie() ;
		
	}

}
